Size-dependent degree distribution of a scale-free growing network

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Degree Distribution of a Two-Component Growing Network

We propose a two-component growing network model which comprises two kinds of nodes. Such a network is constructed by introducing new nodes of either kind with no immediate links and creating new links between any two nodes. We then investigate the connectivity of the two-component growing network by means of the rate equation approach. For a network system with shifted linear connection rate k...

متن کامل

Bounded confidence model on a still growing scale-free network

A Bounded Confidence (BC) model of socio-physics, in which the agents have continuous opinions and can influence each other only if the distance between their opinions is below a threshold, is simulated on a still growing scale-free network considering several different strategies: for each new node (or vertex), that is added to the network all individuals of the network have their opinions upd...

متن کامل

Critical Boolean networks with scale-free in-degree distribution.

We investigate analytically and numerically the dynamical properties of critical Boolean networks with power-law in-degree distributions and for two choices of update functions. When the exponent of the in-degree distribution is larger than 3, we obtain results equivalent to those obtained for networks with fixed in-degree, e.g., the number of the nonfrozen nodes scales as N(2/3) with the syste...

متن کامل

Maximum matchings in scale-free networks with identical degree distribution

The size and number of maximum matchings in a network have found a large variety of applications in many fields. As a ubiquitous property of diverse real systems, power-law degree distribution was shown to have a profound influence on size of maximum matchings in scale-free networks, where the size of maximum matchings is small and a perfect matching often does not exist. In this paper, we stud...

متن کامل

Degree-Distribution Stability of Growing Networks

In this paper, we abstract a kind of stochastic processes from evolving processes of growing networks, this process is called growing network Markov chains. Thus the existence and the formulas of degree distribution are transformed to the corresponding problems of growing network Markov chains. First we investigate the growing network Markov chains, and obtain the condition in which the steady ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review E

سال: 2001

ISSN: 1063-651X,1095-3787

DOI: 10.1103/physreve.63.062101